Algebraic Methods in Computational Complexity 3 Formula Size Lower Bounds and Quantum States
نویسندگان
چکیده
From 10.10.04 to 15.10.04, the Dagstuhl Seminar 04421 Algebraic Methods in Computational Complexity was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Remarks on Graph Complexity
We revisit the notion of graph complexity introduced by Pudll ak, RR odl, and Savick y PRS]. Using their framework, we show that suuciently strong superlinear monotone lower bounds for the very special class of 2-slice functions would imply superpolynomial lower bounds for some other functions. Given an n-vertex graph G, the corresponding 2-slice function fG on n variables evaluates to zero on ...
متن کاملOn Algebraic Branching Programs of Small Width
In 1979 Valiant showed that the complexity class VPe of families with polynomially bounded formula size is contained in the class VPs of families that have algebraic branching programs (ABPs) of polynomially bounded size. Motivated by the problem of separating these classes we study the topological closure VPe, i.e. the class of polynomials that can be approximated arbitrarily closely by polyno...
متن کاملOne-way communication complexity and the Neciporuk lower bound on formula size
In this paper the Nečiporuk method for proving lower bounds on the size of Boolean formulae is reformulated in terms of one-way communication complexity. We investigate the scenarios of probabilistic formulae, nondeterministic formulae, and quantum formulae. In all cases we can use results about one-way communication complexity to prove lower bounds on formula size. In the latter two cases we n...
متن کاملOne-way Communication Complexity and the Ně Ciporuk Lower Bound on Formula Size
The Nečiporuk method for proving lower bounds on the size of Boolean formulae is reformulated in terms of one-way communication complexity. We investigate the scenarios of probabilistic formulae, nondeterministic formulae, and quantum formulae. In all cases we can use results about one-way communication complexity to prove lower bounds on formula size. In the latter two cases we newly develop t...
متن کاملSpan programs and quantum query algorithms
Quantum query complexity measures the number of input bits that must be read by a quantum algorithm in order to evaluate a function. Høyer et al. (2007) have generalized the adversary semidefinite program that lower-bounds quantum query complexity. By giving a matching quantum algorithm, we show that the general adversary lower bound is tight for every boolean function. The proof is based on sp...
متن کامل